Non-interactive Zero-Sharing with Applications to Private Distributed Decision Making

نویسندگان

  • Aggelos Kiayias
  • Moti Yung
چکیده

We employ the new primitive of non-interactive zero-sharing to realize efficiently and privately various “distributed decision making” procedures. Our methodology emphasizes non-interactiveness and universal verifiability. Non-interactiveness suggests that there is no need for bilateral communication between the active participants; instead decision making is achieved by unilateral communication between active participants and a non-trusted server that participates in the protocol. Universal verifiability, in our setting, suggests that the participants’ actions produce a public audit trail that ensures to the public that they are following the specifications of the protocol. Based on non-interactive zero-sharing, we present concrete constructions for a private veto protocol, a protocol for simultaneous disclosure of information, and a privacyenhancing “plug-in” tool for electronic voting that can be incorporated in homomorphic-encryption based schemes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

Poster: Differentially Private Decision Tree Learning from Distributed Data

The goal of privacy preserving data sharing is to share data for further analysis without revealing sensitive information. In this work, we propose a new Secure Multi-Party Computation (SMPC) protocol using Differential Privacy (DP) to protect data privacy while applying decision tree algorithm to horizontally distributed data. Pure secure multiparty computation approaches (using cryptographic ...

متن کامل

An Interactive Allocation for Depot-Customer-Depot in a Multi Aspect Supply Chain Network

Supply chain excellence has a real huge impact on business strategy. Building supply chains (SCs) as flexible system represents one of the most exciting opportunities to create value. This requires integrated decision making amongst autonomous chain partners with effective decision knowledge sharing among them. The key to success lies in knowing which decision has more impact on the supply chai...

متن کامل

Non-Interactive Verifiable Secret Sharing for Monotone Circuits

We propose a computationally secure and non-interactive verifiable secret sharing scheme that can be efficiently constructed from any monotone Boolean circuit. By non-interactive we mean that the dealer needs to be active only once, where he posts a public message as well as a private message to each shareholder. In the random oracle model, we can even avoid interaction between shareholders. By...

متن کامل

Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data

This paper presents a non-interactive verifiable secret sharing scheme (VSS) tolerating a dishonest majority based on data predistributed by a trusted authority. As an application of this VSS scheme we present very efficient unconditionally secure multiparty protocols based on pre-distributed data which generalize two-party computations based on linear pre-distributed bit commitments. The main ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003